Clp(sc): Implementation and Eeciency Considerations
نویسنده
چکیده
CLP(SC) is a constraint logic programming language over set constraints proposed by Kozen 7]. In this paper, we describe a complete C++ implementation of CLP(SC). We describe the data structures used to represent systems of set constraints and an eecient algorithm, a modiication of one given in 7], for unifying constraints. In addition, we investigate two further techniques for increasing eeciency: keeping track of variable equalities and doing PROLOG-style uniication.
منابع مشابه
An Impartial Eeciency Comparison of Fd Constraint Systems
1 A one page summary will be published in the proceedings of the 1998 Conference on Constraint programming (CP'98) Abstract. This paper compares the eeciency of a number of Constraint Logic Programming (CLP) systems in the setting of nite domains. One of the main reasons for adopting CLP technology for solving a problem is the provision of an eecient implementation for the computationally expen...
متن کاملClp(b) : Combining Simplicity and Eeciency in Boolean Constraint Solving
We present the design and the implementation of clp(B): a boolean constraint solver in the Constraint Logic Programming paradigm. This solver is based on local propagation methods and follows the \glass-box" approach of compiling high-level constraints into primitive low-level ones. We detail its integration into the WAM showing that the necessary extension is truly minimal since only four new ...
متن کاملA Metalevel Compiler of CLP(FD) and Its Combination with Intelligent Backtracking
We propose an implementation of constraint solving over nite domains, as pioneered by CHIP, on top of any Prolog system that provides a delay mechanism and backtrackable assignment. The aim is to propose a simple, portable, easily-maintenable, but yet eecient package. The performances of our system are of the same order of magnitude than a "wired" implementation of nite domains such as CHIP, ev...
متن کاملA Semantic Basis for the Termination Analysis of Logic Programs
This paper presents a formal semantic basis for the termination analysis of logic programs. The semantics exhibits the termination properties of a logic program through its binary unfoldings | a possibly innnite set of binary clauses. Termination of a program P and goal G is determined by the absence of an innnite chain in the binary unfoldings of P starting with G. The result is of practical u...
متن کاملCopying, Sharing, and Aliasing
Study of the history of programming languages reveals a subtle interplay between semantics and implementation. Early languages, designed for maximum eeciency, provided simple abstractions of the underlying hardware. These languages were followed by languages that were \problem oriented" in that they attempted to hide the grosser details of the underlying hardware. Yet confusion between semantic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996